detection task
Constructing efficient channels for ideal observers using the conjugate gradient method
Purpose: Task-based assessment of image quality (IQ) is critically important for the design and optimization of medical imaging systems. Ideal observers, including the Bayesian Ideal Observer (IO) and the ideal linear observer, i.e., the Hotelling observer (HO), provide objective figures of merit (FOMs) that quantify system performance on signal detection tasks. However, the application of ideal observers to high-dimensional image data is often computationally intractable. Channel mechanisms provide an effective framework for dimensionality reduction that can facilitate the computation of ideal observers. This work presents a conjugate gradient (CG)-based method to construct efficient channels for approximating the IO and HO performance.
Supplementary Materials for the Paper " Towards Free Data Selection with General-Purpose Models " Anonymous Author(s) Affiliation Address email
In this supplementary material, we first explain the details of spectral clustering algorithm in Sec. B. We also analyze the sensitivity of FreeSel to the values of hyperparameters in3 Sec. C. Besides, FreeSel is compared with other intuitive baselines using the general-purpose model4 in Sec. D. Finally, implementation details of our experiments are explained in Sec. E. Our code will5 be made publicly available.6 In this section, we explain the spectral clustering algorithm [14, 18] in the semantic pattern extraction8 process for each image I (Sec.
A Novel Unified Architecture for Low-Shot Counting by Detection and Segmentation
Low-shot object counters estimate the number of objects in an image using few or no annotated exemplars. Objects are localized by matching them to prototypes, which are constructed by unsupervised image-wide object appearance aggregation.Due to potentially diverse object appearances, the existing approaches often lead to overgeneralization and false positive detections.Furthermore, the best-performing methods train object localization by a surrogate loss, that predicts a unit Gaussian at each object center. This loss is sensitive to annotation error, hyperparameters and does not directly optimize the detection task, leading to suboptimal counts.We introduce GeCo, a novel low-shot counter that achieves accurate object detection, segmentation, and count estimation in a unified architecture.GeCo robustly generalizes the prototypes across objects appearances through a novel dense object query formulation. In addition, a novel counting loss is proposed, that directly optimizes the detection task and avoids the issues of the standard surrogate loss. GeCo surpasses the leading few-shot detection-based counters by $\sim$25\% in the total count MAE, achieves superior detection accuracy and sets a new solid state-of-the-art result across all low-shot counting setups. The code will be available on GitHub.
SupplementaryMaterialsforthePaper" Towards Free DataSelectionwithGeneral-PurposeModels " AnonymousAuthor(s) Affiliation Address email
The detailed spectral clustering9 algorithm is shown in Alg. 1. This spectral clustering algorithm should be inserted into line 7 of10 Alg.1inourmainpaper.11 Interestingly, these two feature clustering strategies lead to similar data16 selection performance on PASCALVOC [7] object detection task. In this part, we pay attention to the effect of pretraining on the final performance of FreeSel. Randaugment: Practical automated data124 augmentation with areduced search space.
Data Parameters: A New Family of Parameters for Learning a Differentiable Curriculum
Recent works have shown that learning from easier instances first can help deep neural networks (DNNs) generalize better. However, knowing which data to present during different stages of training is a challenging problem. In this work, we address this problem by introducing data parameters. More specifically, we equip each sample and class in a dataset with a learnable parameter (data parameters), which governs their importance in the learning process. During training, at each iteration, as we update the model parameters, we also update the data parameters. These updates are done by gradient descent and do not require hand-crafted rules or design. When applied to image classification task on CIFAR10, CIFAR100,WebVision and ImageNet datasets, and object detection task on KITTI dataset, learning a dynamic curriculum via data parameters leads to consistent gains, without any increase in model complexity or training time. When applied to a noisy dataset, the proposed method learns to learn from clean images and improves over the state-of-the-art methods by 14%. To the best of our knowledge, our work is the first curriculum learning method to show gains on large scale image classification and detection tasks.